On finding augmenting graphs
نویسندگان
چکیده
منابع مشابه
On finding augmenting graphs
Method of augmenting graphs is a general approach to solve the maximum independent set problem. As the problem is generally NP-hard, no polynomial-time algorithms are available to implement the method. However, when restricted to particular classes of graphs, the approach may lead to efficient solutions. A famous example of this nature is the matching algorithm: it finds a maximum matching in a...
متن کاملFinding augmenting chains in extensions of claw-free graphs
Finding augmenting chains is in the heart of the maximum matching problem, which is equivalent to the maximum stable set problem in the class of line graphs. Due to the celebrated result of Edmonds, augmenting chains can be found in line graphs in polynomial time. Minty and Sbihi generalized this result to claw-free graphs. In this paper we extend it to larger classes. As a particular consequen...
متن کاملAugmenting Outerplanar Graphs to Meet Diameter Requirements
Given a graph G = (V, E) and an integer D ≥ 1, we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless P = NP , while the problem with only a few graph classes such as forests is approximable within a constant factor....
متن کاملAugmenting Graphs to Meet Edge-Connectivity Requirements
Andrds Frank Research Institute for Discrete Mathematics, Institute for Operations Research, University of Bonn, West Germany and Department of Computer Science, Eiitviis University, Hungary. What is the minimum number 7 of edges to be added to a given graph G so that in the resulting graph the edge-connectivity between every pair {U, U} of nodes is at least a prescribed value T(U, v)? Generali...
متن کاملCombinatorics and algorithms for augmenting graphs
The notion of augmenting graphs generalizes Berge’s idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set (MIS) problem. Recently, the augmenting graph approach has been successfully applied to solve MIS in various other special cases. However, our knowledge of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.008